Geometric Crossover for Biological Sequences
نویسندگان
چکیده
This paper extends a geometric framework for interpreting crossover and mutation [4] to the case of sequences. This representation is important because it is the link between artificial evolution and biological evolution. We define and theoretically study geometric crossover for sequences under edit distance and show its intimate connection with the biological notion of sequence homology.
منابع مشابه
Geometric Crossover for Supervised Motif Discovery
Motif discovery is a general and important problem in bioinformatics, as motifs often are used to infer biologically important sites in bio-molecular sequences. Many problems in bioinformatics are naturally cast in terms of sequences, and distance measures for sequences derived from edit distance is fundamental in bioinformatics. Geometric Crossover is a representation-independent definition of...
متن کاملGeometric Crossover for Supervised Motif Discovery
Motif discovery is a general and important problem in bioinformatics, as motifs often are used to infer biologically important sites in bio-molecular sequences. Many problems in bioinformatics are naturally cast in terms of sequences, and distance measures for sequences derived from edit distance is fundamental in bioinformatics. Geometric Crossover is a representation-independent definition of...
متن کاملA computational method to analyze the similarity of biological sequences under uncertainty
In this paper, we propose a new method to analyze the difference and similarity of biological sequences, based on the fuzzy sets theory. Considering the sequence order and some chemical and structural properties, we present a computational method to cluster the biological sequences. By some examples, we show that the new method is relatively easy and we are able to compare the sequences of arbi...
متن کاملQuotient Geometric Crossovers
Geometric crossover is a representation-independent definition of crossover based on the distance of the search space interpreted as a metric space. It generalizes the traditional crossover for binary strings and other important recombination operators for the most frequently used representations. Using a distance tailored to the problem at hand, the abstract definition of crossover can be used...
متن کاملGeometric Crossover for Permutations with Repetitions: Applications to Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work we have applied geometric crossover to simple permutations. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006